A Note on the Structure of the Central Path in Linear Programming
نویسندگان
چکیده
The central path for linear programming instance L(A, b, c) consists of two types of segments: one almost straight and the other curved. In this note we obtain an inequality ⌊ n2 8 ⌋ ≤ Ns ≤ n2 on the total number of segments Ns of the central path and use this inequality to obtain the lower and the upper bounds on the number of iterations Ñ to solve a linear programming problem i.e., ⌊ n2 8 ⌋ .min { ps, pc } ≤ Ñ ≤ n2.max {ps, pc}. Mathematics Subject Classification: 65K05, 68Q25, 90C05, 90C051, 90C60, 49M35
منابع مشابه
A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS
There are several methods for solving fuzzy linear programming (FLP)problems. When the constraints and/or the objective function are fuzzy, the methodsproposed by Zimmermann, Verdegay, Chanas and Werners are used more often thanthe others. In the Zimmerman method (ZM) the main objective function cx is addedto the constraints as a fuzzy goal and the corresponding linear programming (LP)problem w...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملA New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کاملCorrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path
In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...
متن کاملSome Geometrical Bases for Incremental-Iterative Methods (RESEARCH NOTE)
Finding the equilibrium path by non-linear structural analysis is one of the most important subjects in structural engineering. In this way, Incremental-Iterative methods are extremely used. This paper introduces several factors in incremental steps. In addition, it suggests some control criteria for the iterative part of the non-linear analysis. These techniques are based on the geometric of e...
متن کاملThe Calculation of the output price vectorby applying reverse linear programming: The novel approach in DEA
In the today’s world wherein every routine is based on economic factors, there is no doubt that theoretical sciences are driven by their capabilities and affordances in terms of economy. As a mathematical tool, data envelopment analysis (DEA) is provided to economics, so that one can investigate associated costs, prices and revenues of economic units. Data Envelopment Analysis (DEA) is a linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010